Abstract First Order Computability. II
نویسندگان
چکیده
منابع مشابه
A A PSPACE-Complete First Order Fragment of Computability Logic
Computability Logic (CoL), introduced by Japaridze in [2003; 2009a], is a research program for developing logic as a formal theory of interactive computability. Formulas in it are understood as (interactive) computational problems and logical operators represent operations on such entities. The goal of this program is to define a systematic way to answer the question “what can be computed?” wit...
متن کاملAbstract correction of first-order functional programs
Correction of First-Order Functional Programs M. Alpuente a D. Ballis b S. Escobar a M. Falaschi b S. Lucas a a DSIC, Universidad Politécnica de Valencia, Camino de Vera s/n, Apdo. 22012, 46071 Valencia, Spain. Email: {alpuente,sescobar,slucas}@dsic.upv.es. b Dip. Matematica e Informatica, Via delle Scienze 206, 33100 Udine, Italy. Email: {demis,falaschi}@dimi.uniud.it.
متن کاملAbstract Computability, Algebraic Specification and Initiality
Computability and Algebraic Specifications Abstract Abstract computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all absract computable functions on any many-sorted algebra; and (ii) all functions effectively approximable by abstract ...
متن کاملGeneralizing Computability Theory to Abstract Algebras
We present a survey of our work over the last few decades on generalizations of computability theory to many-sorted algebras. The following topics are discussed, among others: (1) abstract v concrete models of computation for such algebras; (2) computability and continuity, and the use of many-sorted topological partial algebras, containing the reals; (3) comparisons between various equivalent ...
متن کاملOn abstract resource semantics and computability logic
We show that the uniform validity is equivalent to the non-uniform validity for Blass’ semantics of [A game semantics for linear logic. Annals of Pure and Applied Logic 56 (1992) 183–220]. We present a shorter proof (than that of [G. Japaridze. The intuitionistic fragment of computability logic at the propositional level. Annals of Pure and Applied Logic 147 (2007), No.3, pp.187-227]) of the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1969
ISSN: 0002-9947
DOI: 10.2307/1994927